Block image retrieval based on a compressed linear quadtree

نویسنده

  • Yung-Kuan Chan
چکیده

Based on a compressed linear quad tree, a data structure is proposed which is more than a structure to compress a gray-level or color image, but a structure, which can be applied to retrieve a block image. This compressed linear quadtree may directly extract a detailed block image without decompressing the compressed data of the original image.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Medical Image Indexing and Compression Based on Vector Quantization: Image Retrieval Efficiency Evaluation

This paper addresses the problem of efficient image retrieval from a compressed image database, using information derived from the compression process. Images in the database are compressed applying two approaches: Vector Quantization (VQ) and Quadtree image decomposition. Both are based on Konohen’s Self-Organizing Feature Maps (SOFM) for creating vector quantization codebooks. However, while ...

متن کامل

Image Retrieval Using Dynamic Weighting of Compressed High Level Features Framework with LER Matrix

In this article, a fabulous method for database retrieval is proposed.  The multi-resolution modified wavelet transform for each of image is computed and the standard deviation and average are utilized as the textural features. Then, the proposed modified bit-based color histogram and edge detectors were utilized to define the high level features. A feedback-based dynamic weighting of shap...

متن کامل

Image Compression based on Quadtree and Polynomial

In this paper, an efficient image compression scheme is introduced, it is based on partitioning the image into blocks of variable sizes according to its locally changing image characteristics and then using the polynomial approximation to decompose image signal with less compressed information required compared to traditional predictive coding techniques, finally Huffman coding utilized to impr...

متن کامل

Variable-Rate Quadtree-segmented Block Truncation Coding for Color Image Compression

A novel color image compression scheme based on block truncation coding is proposed in this paper. In this scheme, the quadtree segmentation technique is employed to partition the color image into variable-sized image blocks according to its block activities. Then, the block truncation coding scheme with the bit map omission technique is employed to encode the image blocks. According to the exp...

متن کامل

Adaptive Wavelet Image Block Coding

In this paper a new approach for adaptive wavelet image coding is introduced. Based on an adaptive quadtree image-block partition (similar to fractal coding) the diierent image blocks may be compressed independently in an adaptive manner. In order to adapt to local image statistics and features we present several possibilities how to optimize the transform part of a wavelet image block-coder. A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Image Vision Comput.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2004